Trylock, a case for temporal logic and eternity variables
نویسندگان
چکیده
An example is given of a software algorithm that implements its specification in linear time temporal logic (LTL), but not branching (CTL). In LTL, prophecy future behaviour needed to prove the simulation. Eternity variables are used for this purpose. The final phase proof refinement mapping which two threads exchange roles. implementation trylock variation fast mutual exclusion Lamport (1987). It has been fruitfully construction algorithms high performance exclusion.
منابع مشابه
Eternity Variables to Simulate Specifications
Simulation of specifications is introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. Eternity variables are introduced as a more powerful alternative for prophecy variables and backward simulations. This formalism is semantically complete: every simulation is a composition of a forward simula...
متن کاملTemporal logic programs with variables
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of TEL that shares the syntax of first-order Linear-time Temporal Logic (LTL) but has a different ...
متن کاملFirst-Order Logic with Two Variables and Unary Temporal Logic
We investigate the power of first-order logic with only two variables over ω-words and finite words, a logic denoted by FO. We prove that FO can express precisely the same properties as linear temporal logic with only the unary temporal operators: “next”, “previously”, “sometime in the future”, and “sometime in the past”, a logic we denote by unary-TL. Moreover, our translation from FO to unary...
متن کاملMonodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic is not equivalent to general propositional quantification, as the latter admit satisfiable formulae without countable models. We consider the de...
متن کاملTemporal Logic Case Study
This report is a case study applying temporal logic to specify the operation of a bank of identical elevators servicing a number of floors in a building. The goal of the study was to understand the application of temporal logic in a problem domain that is appropriate for the method, and to determine some of the strengths and weaknesses of temporal logic in this domain. The case study uses a fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2022
ISSN: ['1872-7964', '0167-6423']
DOI: https://doi.org/10.1016/j.scico.2021.102767